In article <Xns### [at] 204213191226>, "Rafal 'Raf256' Maj"
<raf### [at] raf256com> wrote:

> there are 2 photons, and bin-tree (in 3d - octall-tree) stors them in

How did you guess this?  Surely not from the source code...

Photons are stored in a kd-tree and radiosity data is stored in an oct-tree.

>    root
>     / \
>   1-4  5-8(no)
>  /   \
> 1-2  2-3(no)
> / \
> *  *

Unless this is an extremly simplified example, this looks very much like a
binary tree to me.  Both, kd-trees and oct-trees, are fairly advanced data
structures compared to simple binary trees.

Apart from that you may want to do some profiling before you jump to the
conclusion that the tree searchs are slow rather than more frequently used
code (such a the priority queue for photons).  If there is any benefit from
using an oct-tree for photons may sound like an interesting question, but
without a very good understanding of photons that is not easy to answer, let
alone implement.


    Thorsten


____________________________________________________
Thorsten Froehlich, Duisburg, Germany
e-mail: tho### [at] trfde

Visit POV-Ray on the web: http://mac.povray.org

Post a reply to this message